Large Holes in Quasi-Random Graphs

نویسنده

Joanna Polcyn

چکیده

Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths in quasi-random pairs is stated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on Upper Density of Quasi-Random Hypergraphs

In 1964, Erdős proved that for any α > 0, an l-uniform hypergraph G with n > n0(α, l) vertices and α ( n l ) edges contains a large complete l-equipartite subgraph. This implies that any sufficiently large G with density α > 0 contains a large subgraph with density at least l!/ll. In this note we study a similar problem for l-uniform hypergraphs Q with a weak quasi-random property (i.e. with ed...

متن کامل

Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs

Recently nmch at tent ion has been focused on the theory of quasi-random graph and hypergraph properties. The class of quasi-random graphs is defined by certain equivalent graph properties possessed by random graphs. We shall investigate properties P which do not imply quasi-randomness for sequences (Gn) of graphs on their own, but do imply if they hold not only for the whole graph Gn but also ...

متن کامل

Sparse Quasi-Random Graphs

Quasi-random graph properties form a large equivalence class of graph properties which are all shared by random graphs. In recent years, various aspects of these properties have been treated by a number of authors (e.g., see [5]-[14], [16], [23]-[27]). Almost all of these results deal with dense graphs, that is, graphs on n vertices having cn edges for some c > 0 as n → ∞. In this paper, we ext...

متن کامل

Quasi-random hypergraphs revisited

The quasi-random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k-graphs (i.e., k-uniform hypergraphs), an analogous quasi-random class contains various equivalent graph properties including the k-discrepancy property (bounding the number of edges in the generalized induced subgraph determined by an...

متن کامل